Beyond Static Mini-Bucket: Towards Integrating with Iterative Cost-Shifting Based Dynamic Heuristics
نویسندگان
چکیده
We explore the use of iterative cost-shifting as a dynamic heuristic generator for solving MPE in graphical models via Branch and Bound. When mini-bucket elimination is limited by its memory budget, it may not provide good heuristics. This can happen often when the graphical model has a very high induced width with large variable domain sizes. In addition, we explore a hybrid setup where both MBE and the iterative costshifting bound are used in a combined heuristic. We compare these approaches with the most advanced statically generated heuristics.
منابع مشابه
Look-Ahead with Mini-Bucket Heuristics for MPE
The paper investigates the potential of look-ahead in the context of AND/OR search in graphical models using the MiniBucket heuristic for combinatorial optimization tasks (e.g., MAP/MPE or weighted CSPs). We present and analyze the complexity of computing the residual (a.k.a. Bellman update) of the Mini-Bucket heuristic and show how this can be used to identify which parts of the search space a...
متن کاملBranch and Bound with Mini-Bucket Heuristics
The paper describes a new generic branch and bound scheme that uses heuristics generated mechanically by the mini-bucket approximation. The scheme is presented and evaluated for the Most Probable Explanation (MPE) task in Bayesian networks. We show that the mini-bucket scheme yields monotonic heuristics of varying strengths which cause different amounts of pruning during search. The resulting B...
متن کاملMini-Bucket Heuristics for Improved Search
The paper is a second in a series of two pa pers evaluating the power of a new scheme that generates search heuristics mechanically. The heuristics are extracted from an approx imation scheme called mini-bucket elimina tion that was recently introduced. The first paper introduced the idea and evaluated it within Branch-and-Bound search. In the cur rent paper the idea is further extended and...
متن کاملWinning the PASCAL 2011 MAP Challenge with Enhanced AND/OR Branch-and-Bound
This paper describes our entry for the MAP/MPE track of the PASCAL 2011 Probabilistic Inference Challenge, which placed first in all three time limit categories, 20 seconds, 20 minutes, and 1 hour. Our baseline is a branch-and-bound algorithm that explores the AND/OR context-minimal search graph of a graphical model guided by a mini-bucket heuristic. Augmented with recent advances that convert ...
متن کاملNew Mini-Bucket Partitioning Heuristics for Bounding the Probability of Evidence
Mini-Bucket Elimination (MBE) is a well-known approximation algorithm deriving lower and upper bounds on quantities of interest over graphical models. It relies on a procedure that partitions a set of functions, called bucket, into smaller subsets, called mini-buckets. The method has been used with a single partitioning heuristic throughout, so the impact of the partitioning algorithm on the qu...
متن کامل